Independence Number, Neighborhood Intersection and Hamiltonian Properties
نویسندگان
چکیده
منابع مشابه
Hamiltonian properties and the bipartite independence number
By using the notion of compatibility of subgraphs with a perfect matching developed for digraphs in [1], we show that if, in a balanced bipartite graph G of minimum degree 6, the maximum cardinality ebip of a balanced independent subset satisfies ~bip ~< 26-4, then G is hamiltonian-biconnected, and if Ctbip ~< 26-2, G contains a hamiltonian path. Moreover, we give some properties of balanced bi...
متن کاملNeighborhood unions and Hamiltonian properties
Let G be a simple graph of order n with connectivity k 3 2, independence number cc We prove that if for each independent set S of cardinality k+ 1, one of the following condition holds: (1) there exist u # v in S such that d(u) +d(v) > n or ) N(u)nN(v) I> cr; (2) for any distinct pair u and u in S, )N(u)uN(v)J>,n-max{d(x))x~S}, then G is Hamiltonian. Many known results on Hamiltonian graphs are...
متن کاملNeighborhood unions and hamiltonian properties in graphs
We investigate the relationship between the cardinality of the union of the neighborhoods of an arbitrary pair of nonadjacent vertices and various hamiltonian type properties in graphs. In particular, we show that if G is 2-connected, of order p 2 3 and if for every pair of nonadjacent vertices x and y: (a) IN(x) u N( y)l 2 (p 1)/2, then G is traceable, (b) IN(x) u N( y)l 2 (2p 1)/3, then G is ...
متن کاملHamiltonian paths and cycles, number of arcs and independence number in digraphs
Manoussakis, Y. and D. Amar, Hamiltonian paths and cycles, number of arcs and independence number in digraphs, Discrete Mathematics 105 (1992) 157-172. We let D denote a digraph with n vertices, independence number at least (Y and half-degrees at least k. We give (i) a function f(n, a) (respectively f (n, k, a)) such that any digraph with at least f(n, a) (respectively f(n, k, a)) arcs is Hamil...
متن کاملHamiltonian properties of graphs with large neighborhood unions
Bauer, D., G. Fan and H.J. Veldman, Hamiltonian properties of graphs with large neighborhood unions, Discrete Mathematics 96 (1991) 33-49. Let G be a graph of order n, a k =min{~ki=ld(vi): {V 1 . . . . . Vn} is an independent set of vertices in G}, NC=min{IN(u) 13N(v) l :uv~E(G)} and NC2=min{IN(u) t3 N(v)l: d(u, v)=2}. O.~ proved that G is hamiltonian if o2~>n ~>3, while Faudree et al. proved t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Boletim da Sociedade Paranaense de Matemática
سال: 2009
ISSN: 2175-1188,0037-8712
DOI: 10.5269/bspm.v22i2.7480